Dijkstra Shortest Path Algorithm using Global Positioning System
نویسنده
چکیده
Dijkstra’s Algorithm is used to find the shortest path from one node to another node in a graph.Dijkstra’s algorithm is also known as a single source shortest path algorithm. It is applied only on positive weights. In this paper, Global Positioning System is used for adding a new functionality in Dijkstra’s algorithm. In this paper, using Global Positioning System the position parameter is added in the Dijkstra’s algorithm. From this current position is retrieved at any point. By using this current position, the distance can be determined from one node to another node. The shortest path can also find out using this distance. For this an algorithm is proposed.
منابع مشابه
Genetic Algorithm with Immigrants and Memory Schemes for Dynamic Shortest Path Routing Problems in Mobile Ad Hoc Networks using Neural Networks
-This paper presents a novel approach for finding dynamic shortest path in MANET using Genetic Algorithm with Memory schemes and Immigrants and compare that solutions with the result of Radial Basis Functional Network (RBFN) for getting global optimum route. At any time the dynamic location of the node is predicted by location prediction algorithm. The node will be able to periodically record i...
متن کاملExpansion-Based Algorithms for Finding Single Pair Shortest Path on Surface
Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path planning system, and surface nearest neighbor query in spatial database, etc. Currently, to solve the problem, existing algorithms must traverse the entire polyhedral surface. With the rapid advance in areas like Global Positioning Sy...
متن کاملRouting Strategies for Wireless Sensor Networks
This paper evaluates three routing strategies for wireless sensor networks: source, shortest path, and hierarchical-geographical, which are the three most commonly employed by wireless ad-hoc and sensor networks algorithms. Source routing was selected because it does not require costly topology maintenance, while shortest path routing was chosen because of its simple discovery routing approach ...
متن کاملShortest path planning on topographical maps
This thesis introduces a new algorithm for quickly answering repetitive least-cost queries between pairs of points on the Earth's surface as represented by digital topographical maps. The algorithm uses a three-step process; preprocessing, geometrically modified Dijkstra search, and postprocessing. The preprocessing step computes and saves highly valuable global information that describes the u...
متن کاملA Multi-path Hybrid Routing Algorithm in Network Routing
The shortest path tree construction is essential in network routing, and the Dijkstra algorithm, which is a static routing algorithm, is widely used. When some links in a network have new weights, dynamic routing algorithms are more efficient than static routing algorithms. This is because the dynamic routing algorithms reduce redundancy by recomputing only the affected sections of the network ...
متن کامل